Counting Sort Algorithm
Bucket sort may be used for many of the same tasks as counting sort, with a like time analysis; however, compared to counting sort, bucket sort necessitates associated lists, dynamic arrays or a large amount of preallocated memory to keep the sets of items within each bucket, whereas counting sort instead stores a individual number (the count of items) per bucket. Because counting sort uses key values as indexes into an array, it is not a comparison sort, and the Ω(n log N) Although radix sorting itself dates back far longer,
counting sort, and its application to radix sorting, were both invented by Harold H. Seward in 1954.
/*
Petar 'PetarV' Velickovic
Algorithm: Counting Sort
*/
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <iostream>
#include <vector>
#include <list>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <complex>
#define MAX_N 1000001
#define MAX_K 1000001
using namespace std;
typedef long long lld;
int n;
int niz[MAX_N];
int Count[MAX_K];
//Counting sort algoritam za sortiranje niza pozitivnih celih brojeva ne vecih od MAX_K
//Slozenost: O(n + k)
void countingSort()
{
for (int i=0;i<n;i++) Count[niz[i]]++;
int ii = 0;
for (int i=0;i<MAX_K;i++)
{
while (Count[i] > 0)
{
niz[ii++] = i;
Count[i]--;
}
}
}
int main()
{
n = 5;
niz[0] = 4;
niz[1] = 2;
niz[2] = 5;
niz[3] = 1;
niz[4] = 3;
countingSort();
for (int i=0;i<n;i++) printf("%d ",niz[i]);
printf("\n");
return 0;
}
